Uni-transitional Watson-crick D0l Systems Uni-transitional Watson-crick D0l Systems
نویسنده
چکیده
The phenomenon known as Watson-Crick complementarity is basic both in the experiments and theory of DNA computing. While the massive parallelism of DNA strands makes exhaustive searches possible, complementarity constitutes a powerful computational tool. It is also very fruitful to view complementarity as a language-theoretic operation: \bad" words obtained through a generative process are replaced by their complementary ones. This idea seems particularly suitable for Lindenmayer systems. D0L systems augmented with a speci c complementarity transition, Watson-Crick D0L systems, have turned out to be a most interesting model and have already been extensively studied. A language is generated by a WatsonCrick D0L system as a sequence of words. Consequently, the systems can be applied also to compute functions in a natural way. In the present paper, attention is focused on uni-transitional systems, where at most one complementarity transition takes place in the generated sequence. In spite of their seeming simplicity, uni-transitional systems represent a vast extension of ordinary D0L systems. This becomes apparent in their capacity of de ning functions. Quite remarkably, all basic decision problems for uni-transitional systems are algorithmically equivalent among themselves, as well as equivalent to a celebrated open problem. We investigate also a simpler case of systems with regular triggers, as well as pose some open problems.
منابع مشابه
Watson-Crick D0L systems: the power of one transition
We investigate the class of functions computable by uni-transitional Watson–Crick D0L systems: only one complementarity transition is possible during each derivation. The class is characterized in terms of a certain min-operation applied to Z-rational functions. We also exhibit functions outside the class, and show that the basic decision problems are equivalent or harder than a celebrated open...
متن کاملWatson-Crick D0L Systems
D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...
متن کاملUniversal computation with Watson-Crick D0L systems
Watson-Crick D0L systems, introduced in 1997 by V. Mihalache and A. Salomaa, arise from two major principles: the Lindenmayer rewriting and the Watson-Crick complementarity principle. Complementarity can be viewed as a purely language-theoretic operation. Majority of a certain type of symbols in a string (purines vs. pyrimidines) triggers a transition to the complementary string. The paper deal...
متن کاملIterated Morphisms with Complementarity on the DNA Alphabet
Watson-Crick complementarity can be viewed as a language-theoretic operation: \bad" words obtained through a generative process are replaced by their complementary ones. This idea seems particularly suitable for Lindenmayer systems. D0L systems augmented with a speci c complementarity transition, Watson-Crick D0L systems, have turned out to be a most interesting model and have already been exte...
متن کامل